Pre- and End-Haulage of Intermodal Container Terminals Modelled as a Full Truckload Pickup and Delivery Problem with Time Windows
نویسندگان
چکیده
Road transport makes up a large share of total costs of intermodal transport. In this paper preand endhaulage in the service area of intermodal container terminals is modelled as a Full Truckload Pickup and Delivery Problem. A single container is delivered from the terminal to a customer or picked up at a customer location and returned to the terminal. Customers impose hard time windows. A two-phase insertion heuristic is developed. In a first phase delivery customers are paired with pickup customers. These pairs of customers are assigned to routes in a second phase. The initial solution is improved by a local search procedure based on a CROSS operator. The construction heuristic and improvement heuristic are demonstrated by means of a numerical example.
منابع مشابه
A deterministic annealing algorithm for the pre- and end-haulage of intermodal container terminals
The drayage of containers in the service area of an intermodal barge terminal is modelled as a full truckload pickup and delivery problem with time windows (FTPDPTW). Initial solutions are generated with an insertion heuristic and improved with three local search operators. In a post-optimization phase the three search operators are integrated in a deterministic annealing (DA) framework. The me...
متن کاملAn exact algorithm for the full truckload pick-up and delivery problem with time windows: concept and implementation details
Intermodal goods transport is characterized by a main transport by rail, barge or seaborne vessel, preceded and followed by short in time but expensive road transport. Many times trucks pick-up or deliver a single container which leads to a full truckload vehicle routing problem in terms of economically efficient transport services. Time windows induced by the customer or due to external situat...
متن کاملA Multi-Objective Imperialist Competitive Algorithm for Vehicle Routing Problem in Cross-docking Networks with Time Windows
This study addresses the pickup and delivery problem for cross-docking strategy, in which shipments are allowed to be transferred from suppliers to retailers directly as well as through cross-docks. Usual models that investigate vehicle routing in cross-docking networks force all vehicles to stop at the cross-dock even if a shipment is about to a full truckload or the vehicle collects and deliv...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملThe Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window
The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...
متن کامل